Performance of Linear Hashing Schemes for Primary Key Retrieval

Linear hashing is one of the most attractive dynamic hashing schemes. Linear hashing with partial expansions and linear hashing with priority splitting are two variations with improved space and time performance. Here, we propose a new structure, which is termed linear hashing with partial expansions and priority splitting. The above four structures are compared by simulation and it is shown that the new scheme outperforms its predecessors in both time and space costs.